0.03/0.10 % Problem : Vampire---4.8_14521 : TPTP v0.0.0. Released v0.0.0. 0.03/0.11 % Command : run_E %s %d THM 0.10/0.31 % Computer : n011.cluster.edu 0.10/0.31 % Model : x86_64 x86_64 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.10/0.31 % Memory : 8042.1875MB 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64 0.10/0.31 % CPULimit : 1440 0.10/0.31 % WCLimit : 180 0.10/0.31 % DateTime : Mon Jul 3 13:01:54 EDT 2023 0.10/0.31 % CPUTime : 0.15/0.41 Running higher-order theorem provingRunning: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox2/tmp/tmp.mlh4LRCySv/Vampire---4.8_14521 0.15/0.41 # Version: 3.1pre001-ho 0.15/0.43 # Preprocessing class: HSMSSMSSSSSNSSA. 0.15/0.43 # Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 0.15/0.43 # Starting post_as_ho1 with 900s (5) cores 0.15/0.43 # Starting post_as_ho12 with 180s (1) cores 0.15/0.43 # Starting new_ho_3 with 180s (1) cores 0.15/0.43 # Starting ehoh_best2_full_lfho with 180s (1) cores 0.15/0.43 # post_as_ho12 with pid 14700 completed with status 0 0.15/0.43 # Result found by post_as_ho12 0.15/0.43 # Preprocessing class: HSMSSMSSSSSNSSA. 0.15/0.43 # Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 0.15/0.43 # Starting post_as_ho1 with 900s (5) cores 0.15/0.43 # Starting post_as_ho12 with 180s (1) cores 0.15/0.43 # No SInE strategy applied 0.15/0.43 # Search class: HGUSF-FFSF21-SSSFFSBN 0.15/0.43 # Scheduled 5 strats onto 1 cores with 180 seconds (180 total) 0.15/0.43 # Starting post_as_ho12 with 109s (1) cores 0.15/0.43 # post_as_ho12 with pid 14704 completed with status 0 0.15/0.43 # Result found by post_as_ho12 0.15/0.43 # Preprocessing class: HSMSSMSSSSSNSSA. 0.15/0.43 # Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 0.15/0.43 # Starting post_as_ho1 with 900s (5) cores 0.15/0.43 # Starting post_as_ho12 with 180s (1) cores 0.15/0.43 # No SInE strategy applied 0.15/0.43 # Search class: HGUSF-FFSF21-SSSFFSBN 0.15/0.43 # Scheduled 5 strats onto 1 cores with 180 seconds (180 total) 0.15/0.43 # Starting post_as_ho12 with 109s (1) cores 0.15/0.43 # Preprocessing time : 0.001 s 0.15/0.43 # Presaturation interreduction done 0.15/0.43 0.15/0.43 # Proof found! 0.15/0.43 # SZS status Theorem 0.15/0.43 # SZS output start CNFRefutation 0.15/0.43 thf(decl_22, type, y: iS). 0.15/0.43 thf(decl_23, type, x: iS). 0.15/0.43 thf(decl_24, type, cP: iS > iS > iS). 0.15/0.43 thf(decl_25, type, c0: iS). 0.15/0.43 thf(decl_26, type, esk1_1: (iS > $o) > iS). 0.15/0.43 thf(decl_27, type, esk2_1: (iS > $o) > iS). 0.15/0.43 thf(decl_28, type, epred1_0: iS > iS > iS > $o). 0.15/0.43 thf(cS_INCL_LEM5_pme, conjecture, (((![X1:iS > $o]:((![X2:iS]:((X1 @ X2))<=(![X2:iS, X3:iS]:(((X1 @ (cP @ X2 @ X3))<=((X1 @ X3)&(X1 @ X2))))&(X1 @ c0))))&![X2:iS, X3:iS, X4:iS, X5:iS]:(((((X4)=(X5))&((X2)=(X3)))<=((cP @ X2 @ X4)=(cP @ X3 @ X5)))))&![X2:iS, X3:iS]:(((cP @ X2 @ X3)!=(c0))))=>![X6:iS > iS > iS > $o]:(((X6 @ (cP @ c0 @ y) @ (cP @ x @ y) @ (cP @ x @ y))<=(![X7:iS, X8:iS, X9:iS]:(((X6 @ X7 @ X8 @ X9)<=((((X7)=(c0))&((X8)=(X9)))|?[X10:iS, X11:iS, X12:iS, X13:iS, X14:iS, X15:iS]:(((((((X7)=(cP @ X10 @ X11))&(X6 @ X11 @ X13 @ X15))&(X6 @ X10 @ X12 @ X14))&((X9)=(cP @ X14 @ X15)))&((X8)=(cP @ X12 @ X13))))|(((X8)=(c0))&((X7)=(X9))))))&($true))))), file('/export/starexec/sandbox2/tmp/tmp.mlh4LRCySv/Vampire---4.8_14521', cS_INCL_LEM5_pme)). 0.15/0.43 thf(c_0_1, negated_conjecture, ~((((![X1:iS > $o]:(((![X2:iS, X3:iS]:((((X1 @ X3)&(X1 @ X2))=>(X1 @ (cP @ X2 @ X3))))&(X1 @ c0))=>![X2:iS]:((X1 @ X2))))&![X2:iS, X3:iS, X4:iS, X5:iS]:((((cP @ X2 @ X4)=(cP @ X3 @ X5))=>(((X4)=(X5))&((X2)=(X3))))))&![X2:iS, X3:iS]:(((cP @ X2 @ X3)!=(c0))))=>![X6:iS > iS > iS > $o]:((![X7:iS, X8:iS, X9:iS]:((((((X7)=(c0))&((X8)=(X9)))|?[X10:iS, X11:iS, X12:iS, X13:iS, X14:iS, X15:iS]:(((((((X7)=(cP @ X10 @ X11))&(X6 @ X11 @ X13 @ X15))&(X6 @ X10 @ X12 @ X14))&((X9)=(cP @ X14 @ X15)))&((X8)=(cP @ X12 @ X13))))|(((X8)=(c0))&((X7)=(X9))))=>(X6 @ X7 @ X8 @ X9)))=>(X6 @ (cP @ c0 @ y) @ (cP @ x @ y) @ (cP @ x @ y)))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cS_INCL_LEM5_pme])])). 0.15/0.43 thf(c_0_2, negated_conjecture, ![X36:iS > $o, X39:iS, X40:iS, X41:iS, X42:iS, X43:iS, X44:iS, X45:iS, X47:iS, X48:iS, X49:iS, X50:iS, X51:iS, X52:iS, X53:iS, X54:iS, X55:iS]:((((((((X36 @ (esk2_1 @ X36))|~(X36 @ c0)|(X36 @ X39))&((X36 @ (esk1_1 @ X36))|~(X36 @ c0)|(X36 @ X39)))&(~(X36 @ (cP @ (esk1_1 @ X36) @ (esk2_1 @ X36)))|~(X36 @ c0)|(X36 @ X39)))&((((X42)=(X43))|((cP @ X40 @ X42)!=(cP @ X41 @ X43)))&(((X40)=(X41))|((cP @ X40 @ X42)!=(cP @ X41 @ X43)))))&((cP @ X44 @ X45)!=(c0)))&((((((X47)!=(c0))|((X48)!=(X49))|(epred1_0 @ X47 @ X48 @ X49))&(((X47)!=(cP @ X50 @ X51))|~(epred1_0 @ X51 @ X53 @ X55)|~(epred1_0 @ X50 @ X52 @ X54)|((X49)!=(cP @ X54 @ X55))|((X48)!=(cP @ X52 @ X53))|(epred1_0 @ X47 @ X48 @ X49)))&(((X48)!=(c0))|((X47)!=(X49))|(epred1_0 @ X47 @ X48 @ X49)))&~(epred1_0 @ (cP @ c0 @ y) @ (cP @ x @ y) @ (cP @ x @ y))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])). 0.15/0.43 thf(c_0_3, negated_conjecture, ![X2:iS, X3:iS, X4:iS]:(((epred1_0 @ X2 @ X3 @ X4)|((X2)!=(c0))|((X3)!=(X4)))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.15/0.43 thf(c_0_4, negated_conjecture, ![X2:iS, X1:iS > $o]:(((X1 @ (esk2_1 @ X1))|(X1 @ X2)|~((X1 @ c0)))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.15/0.43 thf(c_0_5, negated_conjecture, ![X2:iS]:((epred1_0 @ c0 @ X2 @ X2)), inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_3])])). 0.15/0.43 thf(c_0_6, negated_conjecture, ![X2:iS, X1:iS > $o]:(((X1 @ (esk1_1 @ X1))|(X1 @ X2)|~((X1 @ c0)))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.15/0.43 thf(c_0_7, negated_conjecture, ![X2:iS, X4:iS, X3:iS, X9:iS, X10:iS, X11:iS, X8:iS, X7:iS, X5:iS]:(((epred1_0 @ X2 @ X11 @ X10)|((X2)!=(cP @ X3 @ X4))|~((epred1_0 @ X4 @ X5 @ X7))|~((epred1_0 @ X3 @ X8 @ X9))|((X10)!=(cP @ X9 @ X7))|((X11)!=(cP @ X8 @ X5)))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.15/0.43 thf(c_0_8, negated_conjecture, ![X2:iS, X3:iS, X4:iS]:(((epred1_0 @ X3 @ X2 @ X4)|((X2)!=(c0))|((X3)!=(X4)))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.15/0.43 thf(c_0_9, negated_conjecture, ![X2:iS]:(((epred1_0 @ (esk2_1 @ (^[Z0/* 3 */:iS]:((epred1_0 @ Z0 @ Z0 @ Z0)))) @ (esk2_1 @ (^[Z0/* 3 */:iS]:((epred1_0 @ Z0 @ Z0 @ Z0)))) @ (esk2_1 @ (^[Z0/* 3 */:iS]:((epred1_0 @ Z0 @ Z0 @ Z0)))))|(epred1_0 @ X2 @ X2 @ X2))), inference(spm,[status(thm)],[c_0_4, c_0_5])). 0.15/0.43 thf(c_0_10, negated_conjecture, ![X2:iS]:(((epred1_0 @ (esk1_1 @ (^[Z0/* 3 */:iS]:((epred1_0 @ Z0 @ Z0 @ Z0)))) @ (esk1_1 @ (^[Z0/* 3 */:iS]:((epred1_0 @ Z0 @ Z0 @ Z0)))) @ (esk1_1 @ (^[Z0/* 3 */:iS]:((epred1_0 @ Z0 @ Z0 @ Z0)))))|(epred1_0 @ X2 @ X2 @ X2))), inference(spm,[status(thm)],[c_0_6, c_0_5])). 0.15/0.43 thf(c_0_11, negated_conjecture, ~((epred1_0 @ (cP @ c0 @ y) @ (cP @ x @ y) @ (cP @ x @ y))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.15/0.43 thf(c_0_12, negated_conjecture, ![X3:iS, X2:iS, X5:iS, X4:iS, X8:iS, X7:iS]:(((epred1_0 @ (cP @ X2 @ X3) @ (cP @ X4 @ X5) @ (cP @ X7 @ X8))|~((epred1_0 @ X3 @ X5 @ X8))|~((epred1_0 @ X2 @ X4 @ X7)))), inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_7])])])). 0.15/0.43 thf(c_0_13, negated_conjecture, ![X2:iS, X1:iS > $o]:(((X1 @ X2)|~((X1 @ (cP @ (esk1_1 @ X1) @ (esk2_1 @ X1))))|~((X1 @ c0)))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.15/0.43 thf(c_0_14, negated_conjecture, ![X2:iS]:((epred1_0 @ X2 @ c0 @ X2)), inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_8])])). 0.15/0.43 thf(c_0_15, negated_conjecture, (epred1_0 @ (esk2_1 @ (^[Z0/* 3 */:iS]:((epred1_0 @ Z0 @ Z0 @ Z0)))) @ (esk2_1 @ (^[Z0/* 3 */:iS]:((epred1_0 @ Z0 @ Z0 @ Z0)))) @ (esk2_1 @ (^[Z0/* 3 */:iS]:((epred1_0 @ Z0 @ Z0 @ Z0))))), inference(ef,[status(thm)],[c_0_9])). 0.15/0.43 thf(c_0_16, negated_conjecture, (epred1_0 @ (esk1_1 @ (^[Z0/* 3 */:iS]:((epred1_0 @ Z0 @ Z0 @ Z0)))) @ (esk1_1 @ (^[Z0/* 3 */:iS]:((epred1_0 @ Z0 @ Z0 @ Z0)))) @ (esk1_1 @ (^[Z0/* 3 */:iS]:((epred1_0 @ Z0 @ Z0 @ Z0))))), inference(ef,[status(thm)],[c_0_10])). 0.15/0.43 thf(c_0_17, negated_conjecture, ~((epred1_0 @ y @ y @ y)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11, c_0_12]), c_0_5])])). 0.15/0.43 thf(c_0_18, negated_conjecture, ![X2:iS]:((epred1_0 @ X2 @ X2 @ X2)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13, c_0_12]), c_0_14])]), c_0_15]), c_0_16])])). 0.15/0.43 thf(c_0_19, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17, c_0_18])]), ['proof']). 0.15/0.43 # SZS output end CNFRefutation 0.15/0.43 # Parsed axioms : 6 0.15/0.43 # Removed by relevancy pruning/SinE : 0 0.15/0.43 # Initial clauses : 15 0.15/0.43 # Removed in clause preprocessing : 5 0.15/0.43 # Initial clauses in saturation : 10 0.15/0.43 # Processed clauses : 70 0.15/0.43 # ...of these trivial : 5 0.15/0.43 # ...subsumed : 13 0.15/0.43 # ...remaining for further processing : 52 0.15/0.43 # Other redundant clauses eliminated : 43 0.15/0.43 # Clauses deleted for lack of memory : 0 0.15/0.43 # Backward-subsumed : 10 0.15/0.43 # Backward-rewritten : 4 0.15/0.43 # Generated clauses : 330 0.15/0.43 # ...of the previous two non-redundant : 240 0.15/0.43 # ...aggressively subsumed : 0 0.15/0.43 # Contextual simplify-reflections : 0 0.15/0.43 # Paramodulations : 225 0.15/0.43 # Factorizations : 24 0.15/0.43 # NegExts : 0 0.15/0.43 # Equation resolutions : 70 0.15/0.43 # Total rewrite steps : 42 0.15/0.43 # Propositional unsat checks : 0 0.15/0.43 # Propositional check models : 0 0.15/0.43 # Propositional check unsatisfiable : 0 0.15/0.43 # Propositional clauses : 0 0.15/0.43 # Propositional clauses after purity: 0 0.15/0.43 # Propositional unsat core size : 0 0.15/0.43 # Propositional preprocessing time : 0.000 0.15/0.43 # Propositional encoding time : 0.000 0.15/0.43 # Propositional solver time : 0.000 0.15/0.43 # Success case prop preproc time : 0.000 0.15/0.43 # Success case prop encoding time : 0.000 0.15/0.43 # Success case prop solver time : 0.000 0.15/0.43 # Current number of processed clauses : 25 0.15/0.43 # Positive orientable unit clauses : 11 0.15/0.43 # Positive unorientable unit clauses: 0 0.15/0.43 # Negative unit clauses : 2 0.15/0.43 # Non-unit-clauses : 12 0.15/0.43 # Current number of unprocessed clauses: 39 0.15/0.43 # ...number of literals in the above : 117 0.15/0.43 # Current number of archived formulas : 0 0.15/0.43 # Current number of archived clauses : 24 0.15/0.43 # Clause-clause subsumption calls (NU) : 54 0.15/0.43 # Rec. Clause-clause subsumption calls : 39 0.15/0.43 # Non-unit clause-clause subsumptions : 3 0.15/0.43 # Unit Clause-clause subsumption calls : 17 0.15/0.43 # Rewrite failures with RHS unbound : 0 0.15/0.43 # BW rewrite match attempts : 23 0.15/0.43 # BW rewrite match successes : 13 0.15/0.43 # Condensation attempts : 0 0.15/0.43 # Condensation successes : 0 0.15/0.43 # Termbank termtop insertions : 21767 0.15/0.43 0.15/0.43 # ------------------------------------------------- 0.15/0.43 # User time : 0.013 s 0.15/0.43 # System time : 0.004 s 0.15/0.43 # Total time : 0.017 s 0.15/0.43 # Maximum resident set size: 1856 pages 0.15/0.43 0.15/0.43 # ------------------------------------------------- 0.15/0.43 # User time : 0.013 s 0.15/0.43 # System time : 0.006 s 0.15/0.43 # Total time : 0.019 s 0.15/0.43 # Maximum resident set size: 1740 pages 0.15/0.43 % E---3.1 exiting 0.15/0.43 EOF